Finding Palindromes: Variants and Algorithms
نویسنده
چکیده
The problem of finding palindromes in strings appears in many variants: find exact palindromes, ignore punctuation in palindromes, require space around palindromes, etc. This paper introduces several predicates that represent variants of the problem of finding palindromes in strings. It also introduces properties for palindrome predicates, and shows which predicates satisfy which properties. The paper connects the properties for palindrome predicates to two algorithms for finding palindromes in strings, and shows how we can extend some of the predicates to satisfy the properties that allow us to use an algorithm for finding palindromes.
منابع مشابه
The history of finding palindromes
This paper describes the history of finding palindromes in computer science. The problem of determining whether or not a string is a palindrome is one of the oldest computer science problems, and algorithms for this problem have been constructed since the early years of computer science. This paper describes the contributions to solving algorithmic problems related to finding palindromes and va...
متن کاملSearching for Gapped Palindromes
Westudy the problemof finding, in a givenword, allmaximal gappedpalindromes verifying two types of constraints, that we call long-armed and length-constrained palindromes. For each of the two classes, we propose an algorithm that runs in time O(n+ S) for a constantsize alphabet, where S is the number of output palindromes. Both algorithms can be extended to compute biological gapped palindromes...
متن کاملParallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform
There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...
متن کاملAn Expert System for Intelligent Selection of Proper Particle Swarm Optimization Variants
Regarding the large number of developed Particle Swarm Optimization (PSO) algorithms and the various applications for which PSO has been used, selecting the most suitable variant of PSO for solving a particular optimization problem is a challenge for most researchers. In this paper, using a comprehensive survey and taxonomy on different types of PSO, an Expert System (ES) is designed to identif...
متن کاملFinding All Periods and Initial Palindromes of a String in Parallel 1
An optimal O(log log n) time CRCW-PRAM algorithm for computing all period lengths of a string is presented. Previous parallel algorithms compute the period only if it is shorter than half of the length of the string. The algorithm can be used to nd all initial palindromes of a string in the same time and processor bounds. Both algorithms are the fastest possible over a general alphabet. We deri...
متن کامل